Record File Carving Technique for Efficient File Recovery in Digital Forensic Investigation
نویسندگان
چکیده
منابع مشابه
In-Place File Carving
File carving is the process of recovering files from an investigative target, potentially without knowledge of the filesystem structure. Current generation file carvers make complete copies of recovered files. Unfortunately, they often produce a large number of false positives – “junk” files with invalid formats that frequently consume large amounts of disk space. This paper describes an “in-pl...
متن کاملFast in-Place File Carving for Digital Forensics
Scalpel, a popular open source file recovery tool, performs file carving using the Boyer-Moore string search algorithm to locate headers and footers in a disk image. We show that the time required for file carving may be reduced significantly by employing multi-pattern search algorithms such as the multipattern Boyer-Moore and Aho-Corasick algorithms as well as asynchronous disk reads and multi...
متن کاملAccuracy of an Intraoral Digital System for File Length Measurement
Introdouction: Canal length measurement is essential for proper endodontic treatment. Any error or miscalculation in working length determination, particularly in curved canals, can result in complications during or after root canal therapy. Digital radiography has enabled accurate measurement of curved canal length. In this study, we evaluated the accuracy of calibration of a complementary m...
متن کاملA Log File Digital Forensic Model
This paper describes a digital forensic model for investigating computer networks, focusing specifically on network log mining. A thorough examination of log files is needed to reveal the hidden actions of criminals in computer networks. The proposed model specifies the steps that forensic investigators can follow with regard to the extraction and examination of digital evidence from log files ...
متن کاملA Novel Inequality-Based Fragmented File Carving Technique
Fragmented File carving is an important technique in Digital Forensics to recover files from their fragments in the absence of the file system allocation information. In this paper, the fragmented file carving problem is formulated as a graph theoretic problem. Using this model, we describe two algorithms, “Best Path Search” and “High Fragmentation Path Search”, to perform file reconstruction a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KIPS Transactions on Computer and Communication Systems
سال: 2013
ISSN: 2287-5891
DOI: 10.3745/ktccs.2013.2.2.093